Resilient Mechanisms For Truly Combinatorial Auctions

Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mechanism design, as it enables one to predict with confidence which strategies independent players will actually choose. Yet, as with any other form of equilibrium, it too can be extremely vulnerable to collusion. The problem of collusion is particularly evident for unrestricted combinatorial auctions, arguably the hardest type of auctions. We thus investigate how much revenue can be guaranteed, in unrestricted combinatorial auctions, by dominant-strategy-truthful mechanisms that are collusion-resilient in a very strong sense; and obtain almost matching upperand lower-bounds.